0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : run_E %s %d THM 0.11/0.33 % Computer : n014.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1440 0.11/0.33 % WCLimit : 180 0.11/0.33 % DateTime : Thu Jul 4 08:32:24 EDT 2024 0.11/0.33 % CPUTime : 0.17/0.46 Running higher-order theorem proving 0.17/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.u5Vwq93oxQ/E---3.1_17228.p 0.17/0.48 # Version: 3.2.0-ho 0.17/0.48 # Preprocessing class: HSSSSMSSSSSNSSA. 0.17/0.48 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.17/0.48 # Starting post_as_ho12 with 180s (1) cores 0.17/0.48 # Starting new_bool_9 with 180s (1) cores 0.17/0.48 # Starting post_as_ho1 with 180s (1) cores 0.17/0.48 # Starting post_as_ho4 with 180s (1) cores 0.17/0.48 # Starting post_as_ho2 with 180s (1) cores 0.17/0.48 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.17/0.48 # Starting full_lambda_10 with 180s (1) cores 0.17/0.48 # Starting new_ho_8 with 180s (1) cores 0.17/0.48 # post_as_ho12 with pid 17306 completed with status 0 0.17/0.48 # Result found by post_as_ho12 0.17/0.48 # Preprocessing class: HSSSSMSSSSSNSSA. 0.17/0.48 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.17/0.48 # Starting post_as_ho12 with 180s (1) cores 0.17/0.48 # No SInE strategy applied 0.17/0.48 # Search class: HGHSF-FFSF31-MSSFFSNN 0.17/0.48 # partial match(2): HGHPS-FFSF31-MSSFFSNN 0.17/0.48 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.17/0.48 # Starting new_ho_10 with 98s (1) cores 0.17/0.48 # new_ho_10 with pid 17315 completed with status 0 0.17/0.48 # Result found by new_ho_10 0.17/0.48 # Preprocessing class: HSSSSMSSSSSNSSA. 0.17/0.48 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.17/0.48 # Starting post_as_ho12 with 180s (1) cores 0.17/0.48 # No SInE strategy applied 0.17/0.48 # Search class: HGHSF-FFSF31-MSSFFSNN 0.17/0.48 # partial match(2): HGHPS-FFSF31-MSSFFSNN 0.17/0.48 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.17/0.48 # Starting new_ho_10 with 98s (1) cores 0.17/0.48 # Preprocessing time : 0.001 s 0.17/0.48 # Presaturation interreduction done 0.17/0.48 0.17/0.48 # Proof found! 0.17/0.48 # SZS status Theorem 0.17/0.48 # SZS output start CNFRefutation 0.17/0.48 thf(decl_22, type, zero: $i). 0.17/0.48 thf(decl_23, type, s: $i > $i). 0.17/0.48 thf(decl_24, type, ite: $o > $i > $i > $i). 0.17/0.48 thf(decl_25, type, h: $i > $i). 0.17/0.48 thf(decl_26, type, epred1_0: $o). 0.17/0.48 thf(n10, conjecture, (((((![X1:$i]:(((s @ X1)!=(zero)))&![X1:$i]:(((h @ X1)=(ite @ (((X1)=(zero))) @ (s @ zero) @ (ite @ (((X1)=(s @ zero))) @ zero @ (s @ zero))))))&![X1:$i]:(((s @ X1)!=(X1))))&![X2:$o, X3:$i, X4:$i]:((((ite @ ((X2)) @ X3 @ X4)=(X4))<=~((X2)))))&![X2:$o, X3:$i, X4:$i]:(((X2)=>((ite @ ((X2)) @ X3 @ X4)=(X3)))))=>?[X5:$i > $i]:(((((X5 @ zero)=(s @ zero))&((X5 @ (s @ zero))=(zero)))&((X5 @ (s @ (s @ zero)))=(s @ zero))))), file('/export/starexec/sandbox/tmp/tmp.u5Vwq93oxQ/E---3.1_17228.p', n10)). 0.17/0.48 thf(c_0_1, plain, ((epred1_0)<=>((((![X1:$i]:(((s @ X1)!=(zero)))&![X1:$i]:(((((X1)!=(zero))|((((X1)!=(s @ zero))|((h @ X1)=(ite @ $true @ (s @ zero) @ (ite @ $true @ zero @ (s @ zero)))))&(((X1)=(s @ zero))|((h @ X1)=(ite @ $true @ (s @ zero) @ (ite @ $false @ zero @ (s @ zero)))))))&(((X1)=(zero))|((((X1)!=(s @ zero))|((h @ X1)=(ite @ $false @ (s @ zero) @ (ite @ $true @ zero @ (s @ zero)))))&(((X1)=(s @ zero))|((h @ X1)=(ite @ $false @ (s @ zero) @ (ite @ $false @ zero @ (s @ zero))))))))))&![X1:$i]:(((s @ X1)!=(X1))))&![X2:$o, X3:$i, X4:$i]:((~(X2)=>((ite @ ((X2)) @ X3 @ X4)=(X4)))))&![X2:$o, X3:$i, X4:$i]:(((X2)=>((ite @ ((X2)) @ X3 @ X4)=(X3)))))), introduced(definition)). 0.17/0.48 thf(c_0_2, plain, ((epred1_0)=>((((![X1:$i]:(((s @ X1)!=(zero)))&![X1:$i]:(((((X1)!=(zero))|((((X1)!=(s @ zero))|((h @ X1)=(ite @ $true @ (s @ zero) @ (ite @ $true @ zero @ (s @ zero)))))&(((X1)=(s @ zero))|((h @ X1)=(ite @ $true @ (s @ zero) @ (ite @ $false @ zero @ (s @ zero)))))))&(((X1)=(zero))|((((X1)!=(s @ zero))|((h @ X1)=(ite @ $false @ (s @ zero) @ (ite @ $true @ zero @ (s @ zero)))))&(((X1)=(s @ zero))|((h @ X1)=(ite @ $false @ (s @ zero) @ (ite @ $false @ zero @ (s @ zero))))))))))&![X1:$i]:(((s @ X1)!=(X1))))&![X2:$o, X3:$i, X4:$i]:((~(X2)=>((ite @ ((X2)) @ X3 @ X4)=(X4)))))&![X2:$o, X3:$i, X4:$i]:(((X2)=>((ite @ ((X2)) @ X3 @ X4)=(X3)))))), inference(split_equiv,[status(thm)],[c_0_1])). 0.17/0.48 thf(c_0_3, negated_conjecture, ~(((epred1_0)=>?[X5:$i > $i]:(((((X5 @ zero)=(s @ zero))&((X5 @ (s @ zero))=(zero)))&((X5 @ (s @ (s @ zero)))=(s @ zero)))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[n10])])]), c_0_1])). 0.17/0.48 thf(c_0_4, plain, ![X17:$i, X18:$i, X19:$i, X20:$o, X21:$i, X22:$i, X23:$o, X24:$i, X25:$i]:((((((((s @ X17)!=(zero))|~(epred1_0))&(((((X18)!=(s @ zero))|((h @ X18)=(ite @ $true @ (s @ zero) @ (ite @ $true @ zero @ (s @ zero))))|((X18)!=(zero))|~(epred1_0))&(((X18)=(s @ zero))|((h @ X18)=(ite @ $true @ (s @ zero) @ (ite @ $false @ zero @ (s @ zero))))|((X18)!=(zero))|~(epred1_0)))&((((X18)!=(s @ zero))|((h @ X18)=(ite @ $false @ (s @ zero) @ (ite @ $true @ zero @ (s @ zero))))|((X18)=(zero))|~(epred1_0))&(((X18)=(s @ zero))|((h @ X18)=(ite @ $false @ (s @ zero) @ (ite @ $false @ zero @ (s @ zero))))|((X18)=(zero))|~(epred1_0)))))&(((s @ X19)!=(X19))|~(epred1_0)))&((X20)|((ite @ ((X20)) @ X21 @ X22)=(X22))|~(epred1_0)))&(~(X23)|((ite @ ((X23)) @ X24 @ X25)=(X24))|~(epred1_0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])). 0.17/0.48 thf(c_0_5, negated_conjecture, ![X16:$i > $i]:(((epred1_0)&(((X16 @ zero)!=(s @ zero))|((X16 @ (s @ zero))!=(zero))|((X16 @ (s @ (s @ zero)))!=(s @ zero))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])). 0.17/0.48 thf(c_0_6, plain, ![X1:$i, X3:$i]:((((ite @ (~($true)) @ X1 @ X3)=(X3))|~((epred1_0)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])])). 0.17/0.48 thf(c_0_7, negated_conjecture, (epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.17/0.48 thf(c_0_8, plain, ![X3:$i, X1:$i]:((((ite @ (($true)) @ X1 @ X3)=(X1))|~((epred1_0)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])])). 0.17/0.48 thf(c_0_9, plain, ![X1:$i]:((((s @ X1)!=(X1))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.17/0.48 thf(c_0_10, plain, ![X1:$i]:((((X1)=(s @ zero))|((h @ X1)=(ite @ (~($true)) @ (s @ zero) @ (ite @ (~($true)) @ zero @ (s @ zero))))|((X1)=(zero))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.17/0.48 thf(c_0_11, plain, ![X1:$i, X3:$i]:(((ite @ (~($true)) @ X1 @ X3)=(X3))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7])])). 0.17/0.48 thf(c_0_12, plain, ![X1:$i]:((((s @ X1)!=(zero))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.17/0.48 thf(c_0_13, plain, ![X1:$i]:((((X1)=(s @ zero))|((h @ X1)=(ite @ (($true)) @ (s @ zero) @ (ite @ (~($true)) @ zero @ (s @ zero))))|((X1)!=(zero))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.17/0.48 thf(c_0_14, plain, ![X3:$i, X1:$i]:(((ite @ (($true)) @ X1 @ X3)=(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_7])])). 0.17/0.48 thf(c_0_15, plain, ![X1:$i]:(((s @ X1)!=(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_7])])). 0.17/0.48 thf(c_0_16, plain, ![X1:$i]:((((h @ X1)=(ite @ (~($true)) @ (s @ zero) @ (ite @ (($true)) @ zero @ (s @ zero))))|((X1)=(zero))|((X1)!=(s @ zero))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.17/0.48 thf(c_0_17, negated_conjecture, ![X5:$i > $i]:((((X5 @ zero)!=(s @ zero))|((X5 @ (s @ zero))!=(zero))|((X5 @ (s @ (s @ zero)))!=(s @ zero)))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.17/0.48 thf(c_0_18, plain, ![X1:$i]:((((h @ X1)=(s @ zero))|((X1)=(s @ zero))|((X1)=(zero)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11]), c_0_11]), c_0_7])])). 0.17/0.48 thf(c_0_19, plain, ![X1:$i]:(((s @ X1)!=(zero))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_7])])). 0.17/0.48 thf(c_0_20, plain, ((h @ zero)=(s @ zero)), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_11]), c_0_14]), c_0_7])])]), c_0_15])). 0.17/0.48 thf(c_0_21, plain, ((h @ (s @ zero))=(zero)), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_14]), c_0_11]), c_0_7])])]), c_0_15])). 0.17/0.48 thf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_15]), c_0_19]), c_0_20]), c_0_21])]), ['proof']). 0.17/0.48 # SZS output end CNFRefutation 0.17/0.48 # Parsed axioms : 5 0.17/0.48 # Removed by relevancy pruning/SinE : 0 0.17/0.48 # Initial clauses : 14 0.17/0.48 # Removed in clause preprocessing : 4 0.17/0.48 # Initial clauses in saturation : 10 0.17/0.48 # Processed clauses : 24 0.17/0.48 # ...of these trivial : 0 0.17/0.48 # ...subsumed : 2 0.17/0.48 # ...remaining for further processing : 21 0.17/0.48 # Other redundant clauses eliminated : 4 0.17/0.48 # Clauses deleted for lack of memory : 0 0.17/0.48 # Backward-subsumed : 0 0.17/0.48 # Backward-rewritten : 0 0.17/0.48 # Generated clauses : 7 0.17/0.48 # ...of the previous two non-redundant : 6 0.17/0.48 # ...aggressively subsumed : 0 0.17/0.48 # Contextual simplify-reflections : 0 0.17/0.48 # Paramodulations : 3 0.17/0.48 # Factorizations : 0 0.17/0.48 # NegExts : 0 0.17/0.48 # Equation resolutions : 4 0.17/0.48 # Disequality decompositions : 0 0.17/0.48 # Total rewrite steps : 22 0.17/0.48 # ...of those cached : 9 0.17/0.48 # Propositional unsat checks : 0 0.17/0.48 # Propositional check models : 0 0.17/0.48 # Propositional check unsatisfiable : 0 0.17/0.48 # Propositional clauses : 0 0.17/0.48 # Propositional clauses after purity: 0 0.17/0.48 # Propositional unsat core size : 0 0.17/0.48 # Propositional preprocessing time : 0.000 0.17/0.48 # Propositional encoding time : 0.000 0.17/0.48 # Propositional solver time : 0.000 0.17/0.48 # Success case prop preproc time : 0.000 0.17/0.48 # Success case prop encoding time : 0.000 0.17/0.48 # Success case prop solver time : 0.000 0.17/0.48 # Current number of processed clauses : 9 0.17/0.48 # Positive orientable unit clauses : 5 0.17/0.48 # Positive unorientable unit clauses: 0 0.17/0.48 # Negative unit clauses : 2 0.17/0.48 # Non-unit-clauses : 2 0.17/0.48 # Current number of unprocessed clauses: 1 0.17/0.48 # ...number of literals in the above : 2 0.17/0.48 # Current number of archived formulas : 0 0.17/0.48 # Current number of archived clauses : 9 0.17/0.48 # Clause-clause subsumption calls (NU) : 0 0.17/0.48 # Rec. Clause-clause subsumption calls : 0 0.17/0.48 # Non-unit clause-clause subsumptions : 0 0.17/0.48 # Unit Clause-clause subsumption calls : 4 0.17/0.48 # Rewrite failures with RHS unbound : 0 0.17/0.48 # BW rewrite match attempts : 0 0.17/0.48 # BW rewrite match successes : 0 0.17/0.48 # Condensation attempts : 24 0.17/0.48 # Condensation successes : 0 0.17/0.48 # Termbank termtop insertions : 1245 0.17/0.48 # Search garbage collected termcells : 210 0.17/0.48 0.17/0.48 # ------------------------------------------------- 0.17/0.48 # User time : 0.003 s 0.17/0.48 # System time : 0.002 s 0.17/0.48 # Total time : 0.005 s 0.17/0.48 # Maximum resident set size: 1788 pages 0.17/0.48 0.17/0.48 # ------------------------------------------------- 0.17/0.48 # User time : 0.004 s 0.17/0.48 # System time : 0.005 s 0.17/0.48 # Total time : 0.009 s 0.17/0.48 # Maximum resident set size: 1808 pages 0.17/0.48 % E---3.1 exiting 0.17/0.48 % E exiting 0.17/0.48 EOF